A Jordan-Schur Algorithm for Solving Sylvester and Lyapunov Matrix Equations
نویسندگان
چکیده
This paper presents a version of the Bartels-Stewart algorithm for solving Sylvester and Lyapunov equations that utilizes Jordan-Schur form equation matrices. The is type Schur which contains additional information about Jordan structure corresponding matrix. can be used to solve more efficiently in some cases. A two-level implemented allows us find directly non-scalar blocks solution These have sizes are determined by Weyr characteristics associated with eigenvalues In case large elements multiple eigenvalues, determination done efficiency. Also, appropriate parallel computations. Results obtained from numerical experiments confirm accuracy new comparable algorithm.
منابع مشابه
A Schur Method for Solving Projected Continuous-Time Sylvester Equations
In this paper, we propose a direct method based on the real Schur factorization for solving the projected Sylvester equation with relatively small size. The algebraic formula of the solution of the projected continuous-time Sylvester equation is presented. The computational cost of the direct method is estimated. Numerical experiments show that this direct method has high accuracy. Keywords—Pro...
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملA numerical algorithm for solving a class of matrix equations
In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$ by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.
متن کاملA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملDirect Methods for Matrix Sylvester and Lyapunov Equations
We revisit the two standard dense methods for matrix Sylvester and Lyapunov equations: the Bartels-Stewart method for A1X +XA2 +D = 0 and Hammarling’s method for AX + XA + BB = 0 with A stable. We construct three schemes for solving the unitarily reduced quasitriangular systems. We also construct a new rank-1 updating scheme in Hammarling’s method. This new scheme is able to accommodate a B wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Contemporary mathematics
سال: 2022
ISSN: ['2705-1056', '2705-1064']
DOI: https://doi.org/10.37256/cm.3420221851